Decomposition Methods for Network Design

Decomposition Methods for Network Design

Network design applications are prevalent in transportation and logistics. We consider the multicommodity capacitated fixedcharge network design problem (MCND), a generic model that captures three important features of network design applications: the interplay between investment and operational costs, the multicommodity aspect, and the presence of capacity constraints. We focus on mathematical...

Decomposition Methods and Network Design Problems

Benders Decomposition Algorithm for Competitive Supply Chain Network Design under Risk of Disruption and Uncertainty

In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...

A Modified Benders Decomposition Algorithm for Supply Chain Network Design under Risk Consideration

In today’s competitive business environment, the design and management of supply chainnetwork is one of the most important challenges that managers encounter. The supply chain network shouldbe designed for satisfying of customer demands as well as minizing the total system costs. This paper presentsa multi-period multi-stage supply chain network design problem under demand uncertainty. The prob...

On Decomposition Methods for Multidisciplinary Design Optimization

Multidisciplinary design optimization (MDO) problems are engineering design problems that require the consideration of the interaction between several design disciplines. Due to certain organizational aspects of MDO problems, decomposition algorithms are often the only feasible solution approach. Two natural decomposition approaches to the MDO problem are bilevel decomposition algorithms and Sc...